Relation between algebraic and geometric view on nurbs tensor product surfaces
نویسندگان
چکیده
منابع مشابه
Algebraic Geometric Codes on Surfaces
— We study error-correcting codes constructed from projective surfaces over finite fields using the generalized Goppa construction. We obtain bounds for the minimal distance of these codes by understanding how the zero sets of functions on a surface decompose into irreducible components. We also present a decoding algorithm for these codes based on the Luby-Mitzenmacher algorithm for LDPC codes...
متن کاملAlgebraic Geometric codes on Hirzebruch surfaces
We define a linear code Cη(δT , δX) by evaluating polynomials of bidegree (δT , δX) in the Cox ring on Fq-rational points of the Hirzebruch surface on the finite field Fq. We give explicit parameters of the code, notably using Gröbner bases. The minimum distance provides an upper bound of the number of Fq-rational points of a non-filling curve on a Hirzebruch surface. We also display some punct...
متن کاملGeometric Modeling with Algebraic Surfaces
Research in geometric modeling is currently engaged in increasing the geometric coverage to allow modeling operations on arbitrary algebraic surfaces. Operations on models often include Boolean set operations (intersection, union), sweeps and convolutions, convex bull computa· tions, primitive decomposition, surface and volume mesh generatioD, calculation of surface area and volumetric properti...
متن کاملModifying the shape of NURBS surfaces with geometric constraints
NURBS surfaces are among the most commonly used parametric surfaces in CAGD and Computer Graphics. This paper investigates shape modi®cation of NURBS surfaces with geometric constraints, such as point, normal vector, and curve constraints. Two new methods are presented by constrained optimization and energy minimization. The former is based on minimizing changes in control net of surfaces, wher...
متن کاملGeometric algorithms for algebraic curves and surfaces
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrary degree. These algorithms are exact and complete – they return the mathematically true result for all input instances. Efficiency is achieved by cutting back expensive symbolic computation and favoring combinatorial and adaptive numerical methods instead, without spoiling exactness in the overal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 2010
ISSN: 0862-7940,1572-9109
DOI: 10.1007/s10492-010-0016-6